Corner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory
نویسنده
چکیده
Corner Polyhedra were introduced by Gomory in the early 60s and were studied by Gomory and Johnson. The importance of the corner polyhedron is underscored by the fact that almost all “generic” cutting planes, both in the theoretical literature as well as ones used in practice, are valid for the corner polyhedron. So the corner polyhedron can be viewed as a unifying structure from which many of the known cutting planes can be derived. Moreover, the corner polyhedron has recently attracted a lot of attention as a potential source of new kinds of cutting planes. It has also been observed that valid inequalities for the corner polyhedron have an intimate connection with maximal lattice-free convex sets in R. This connection provides a geometric way of understanding and analyzing these valid inequalities. Such an approach often yields new insights into properties of existing cutting planes, as well as provides a novel way of analyzing new families of cutting planes. The goal of this thesis is to explore this interplay of maximal lattice-free convex bodies and cutting plane theory. We also hope to obtain new insights into the structure of the corner polyhedron with the help of this approach.
منابع مشابه
A convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملImproved theoretical guarantees regarding a class of two-row cutting planes
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known that such facet defining inequalities arise from maximal lattice-free splits, triangles and quadrilaterals. We improve on the tightest known upper bound for...
متن کاملMaximal Lattice-Free Convex Sets in Linear Subspaces
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in R.
متن کاملThe Triangle Closure is a Polyhedron
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showe...
متن کاملAn Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form S := {x : π0 ≤ π T x ≤ π0 + 1} called split sets. The set obtained by adding all split cuts is called the split closure, and the split closure is known to be a polyhedron. A split set S has max-facet-width equal to one in the sense that max{π x : x ∈ S}− min{π...
متن کامل